In this paper I argue that human pattern recognition can be simulated by automata. In particular, I show that gestalt recognition and recognition of family resemblances are within the capabilities of sufficiently complex Turing machines. The argument rests on elementary facts of automata and computability theory which are used to explicate our preanalytic, informal concepts concerning gestalt patterns and recognition. The central idea is that of a machine which "knows" its own structure. Although the paper thus aims to support mechanism, (...) especially as a framework hypothesis for perception, it contains suggestions for philosophy of science and philosophy of language as well. Some of these suggestions are sketched in the final section. (shrink)

Environmental ethics tends to be dominated by the idea that the right environmental actions require a change in the value systems of many people. I argue that the “rebirth” approach is perverse in that moral attitudes are not easily changed by moral suasion. A properly ethical approach must begin where we are, as moderately moral people desiring the best for all. The real ethical problem is to develop procedures for collectively defining environmental ends that will be fair to the parties (...) participating in the decision process. This idea is essentially utilitarian, and depends on the maximization of expected social utility. This type of environmental ethics is contrasted with current theories of social choice in welfare economics and with Rawls’ theory of justice as fairness. (shrink)

Quines ontological relativity is related to Tarskis theory of truth in two ways: Quine repudiates term-by-term-correspondence, as does Tarskis rule of truth; and Quines proxy argument in support of relativity finds exact formulation in Tarskis truth definition.Unfortunately, relativity is threatened by the fact that the proxy argument doesnt comply with the rule of truth (Tarskis celebrated condition (T)). Despite Quines express allegiance to (T), use of proxy schemes does not generate all of the true sentences condition (T) requires.

In I used Turing machine arguments to show that computers can recognize humanly recognizable patterns in principle. In 1978 James D. Heffernan has expressed some doubts about such arguments. He does not question the propositions that I defend in the paper, nor the specific arguments in their support. What he does criticize are certain background assumptions.